________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:37:04
Input Data from:  dataset135.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0673333333333333
Average f[i]   :3650
Average g[i,j] :1919,04761904762
Total demand   :16520
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 8
> Selected Move:	1400	1	-1	4	4000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0    >new incumb.: 1400


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 31
> Selected Move:	2390	1	-1	8	9500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0    >new incumb.: 2390


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 37
> Selected Move:	3270	1	-1	7	15000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  0    >new incumb.: 3270


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 38
> Selected Move:	4100	1	-1	5	20000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  1  0    >new incumb.: 4100


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 34
> Selected Move:	4000	3	5	6	19500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 33
> Selected Move:	3880	3	7	9	19500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 33
> Selected Move:	3980	3	6	5	20000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 32
> Selected Move:	3940	3	8	7	20000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 37
> Selected Move:	3840	3	5	6	19500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 36
> Selected Move:	3788	3	6	8	20500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 33
> Selected Move:	3380	3	9	3	21500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 34
> Selected Move:	3712	3	7	6	20500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 33
> Selected Move:	3800	3	3	5	19000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 35
> Selected Move:	3760	3	8	7	19000


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 35
> Selected Move:	3680	3	5	3	20500


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 33
> Selected Move:	3640	3	7	5	20000


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 37
> Selected Move:	3600	3	6	8	21000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,455

## ITERATION 17 #######################


> Neighbours evaluated; 33
> Selected Move:	3555	3	8	7	21000


> New Y[]: 
	
	 2  3  4  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 18 #######################


> Neighbours evaluated; 32
> Selected Move:	3360	3	7	9	21000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 19 #######################


> Neighbours evaluated; 31
> Selected Move:	3570	3	3	6	19000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 20 #######################


> Neighbours evaluated; 33
> Selected Move:	3485	3	5	3	20500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 21 #######################


> Neighbours evaluated; 32
> Selected Move:	3268	3	6	8	21500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,48

## ITERATION 22 #######################


> Neighbours evaluated; 30
> Selected Move:	3220	3	8	7	21500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 23 #######################


> Neighbours evaluated; 32
> Selected Move:	3180	2	9	-1	16000


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 24 #######################


> Neighbours evaluated; 33
> Selected Move:	3220	3	7	8	16000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,495

## ITERATION 25 #######################


> Neighbours evaluated; 32
> Selected Move:	3220	3	3	5	14500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,5

## ITERATION 26 #######################


> Neighbours evaluated; 32
> Selected Move:	3180	3	8	7	14500


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 27 #######################


> Neighbours evaluated; 31
> Selected Move:	3110	3	5	9	15000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 28 #######################


> Neighbours evaluated; 31
> Selected Move:	3150	3	7	8	15000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,495

## ITERATION 29 #######################


> Neighbours evaluated; 30
> Selected Move:	3120	3	9	6	14000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,49

## ITERATION 30 #######################


> Neighbours evaluated; 30
> Selected Move:	3080	3	8	7	14000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 31 #######################


> Neighbours evaluated; 29
> Selected Move:	2960	3	7	3	15000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 32 #######################


> Neighbours evaluated; 30
> Selected Move:	3060	3	6	5	15500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 33 #######################


> Neighbours evaluated; 29
> Selected Move:	2990	3	3	9	14500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 34 #######################


> Neighbours evaluated; 29
> Selected Move:	2990	3	5	3	16000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 35 #######################


> Neighbours evaluated; 27
> Selected Move:	2890	3	3	6	14000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 36 #######################


> Neighbours evaluated; 27
> Selected Move:	2810	3	9	5	13500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 37 #######################


> Neighbours evaluated; 26
> Selected Move:	2600	3	0	8	15200


> New Y[]: 
	
	 0  3  4  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 38 #######################


> Neighbours evaluated; 34
> Selected Move:	3045	1	-1	9	20700


> New Y[]: 
	
	 0  3  4  0  1  1  1  0  2  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 39 #######################


> Neighbours evaluated; 32
> Selected Move:	3004	4	8	9	20800


> New Y[]: 
	
	 0  3  4  0  1  1  1  0  1  2 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 40 #######################


> Neighbours evaluated; 31
> Selected Move:	3016	3	9	7	20600


> New Y[]: 
	
	 0  3  4  0  1  1  1  2  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 41 #######################


> Neighbours evaluated; 32
> Selected Move:	2995	3	7	3	21000


> New Y[]: 
	
	 0  3  4  2  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 42 #######################


> Neighbours evaluated; 31
> Selected Move:	2865	3	5	9	21500


> New Y[]: 
	
	 0  3  4  2  1  0  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 43 #######################


> Neighbours evaluated; 32
> Selected Move:	2882	3	3	7	21100


> New Y[]: 
	
	 0  3  4  0  1  0  1  2  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 44 #######################


> Neighbours evaluated; 30
> Selected Move:	2856	3	8	5	20600


> New Y[]: 
	
	 0  3  4  0  1  1  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 45 #######################


> Neighbours evaluated; 30
> Selected Move:	2764	4	7	9	20800


> New Y[]: 
	
	 0  3  4  0  1  1  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 46 #######################


> Neighbours evaluated; 30
> Selected Move:	2965	3	9	8	20700


> New Y[]: 
	
	 0  3  4  0  1  1  1  1  2  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 47 #######################


> Neighbours evaluated; 29
> Selected Move:	2814	3	5	9	21200


> New Y[]: 
	
	 0  3  4  0  1  0  1  1  2  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 48 #######################


> Neighbours evaluated; 29
> Selected Move:	2762	4	8	9	21300


> New Y[]: 
	
	 0  3  4  0  1  0  1  1  1  2 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 49 #######################


> Neighbours evaluated; 28
> Selected Move:	2732	3	9	3	21500


> New Y[]: 
	
	 0  3  4  2  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 50 #######################


> Neighbours evaluated; 30
> Selected Move:	2750	2	7	-1	16000


> New Y[]: 
	
	 0  3  4  2  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 51 #######################


> Neighbours evaluated; 31
> Selected Move:	2850	3	6	5	16500


> New Y[]: 
	
	 0  3  4  2  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 52 #######################


> Neighbours evaluated; 32
> Selected Move:	2850	4	3	4	19500


> New Y[]: 
	
	 0  3  4  1  2  1  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 53 #######################


> Neighbours evaluated; 34
> Selected Move:	2850	4	4	5	17800


> New Y[]: 
	
	 0  3  4  1  1  2  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,49

## ITERATION 54 #######################


> Neighbours evaluated; 32
> Selected Move:	2850	4	5	8	17200


> New Y[]: 
	
	 0  3  4  1  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 55 #######################


> Neighbours evaluated; 30
> Selected Move:	2780	3	3	9	16200


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,49

## ITERATION 56 #######################


> Neighbours evaluated; 31
> Selected Move:	2780	4	8	4	18500


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 57 #######################


> Neighbours evaluated; 33
> Selected Move:	2780	4	4	5	16800


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 58 #######################


> Neighbours evaluated; 31
> Selected Move:	2780	4	5	9	16300


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  1  2 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 59 #######################


> Neighbours evaluated; 29
> Selected Move:	2780	3	5	3	17800


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  1  2 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 60 #######################


> Neighbours evaluated; 32
> Selected Move:	2780	4	9	3	17000


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 61 #######################


> Neighbours evaluated; 29
> Selected Move:	2780	4	3	4	20000


> New Y[]: 
	
	 0  3  4  1  2  0  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 62 #######################


> Neighbours evaluated; 30
> Selected Move:	2780	4	4	8	17700


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 63 #######################


> Neighbours evaluated; 29
> Selected Move:	2750	3	9	6	16700


> New Y[]: 
	
	 0  3  4  1  1  0  1  0  2  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 64 #######################


> Neighbours evaluated; 30
> Selected Move:	2750	4	8	4	19000


> New Y[]: 
	
	 0  3  4  1  2  0  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 65 #######################


> Neighbours evaluated; 31
> Selected Move:	2750	4	4	6	17800


> New Y[]: 
	
	 0  3  4  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 66 #######################


> Neighbours evaluated; 29
> Selected Move:	2700	3	6	7	17600


> New Y[]: 
	
	 0  3  4  1  1  0  0  2  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 67 #######################


> Neighbours evaluated; 31
> Selected Move:	2700	4	7	3	17000


> New Y[]: 
	
	 0  3  4  2  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 68 #######################


> Neighbours evaluated; 29
> Selected Move:	2700	4	3	4	20000


> New Y[]: 
	
	 0  3  4  1  2  0  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 69 #######################


> Neighbours evaluated; 30
> Selected Move:	2700	4	4	8	17700


> New Y[]: 
	
	 0  3  4  1  1  0  0  1  2  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 70 #######################


> Neighbours evaluated; 28
> Selected Move:	2700	3	3	5	16200


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  2  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 71 #######################


> Neighbours evaluated; 29
> Selected Move:	2755	1	-1	9	21700


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  2  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 72 #######################


> Neighbours evaluated; 27
> Selected Move:	2804	4	8	7	21600


> New Y[]: 
	
	 0  3  4  0  1  1  0  2  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,405

## ITERATION 73 #######################


> Neighbours evaluated; 29
> Selected Move:	2800	3	7	3	22000


> New Y[]: 
	
	 0  3  4  2  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,4

## ITERATION 74 #######################


> Neighbours evaluated; 28
> Selected Move:	2730	3	9	7	22000


> New Y[]: 
	
	 0  3  4  2  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 75 #######################


> Neighbours evaluated; 28
> Selected Move:	2795	3	8	6	21000


> New Y[]: 
	
	 0  3  4  2  1  1  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,4

## ITERATION 76 #######################


> Neighbours evaluated; 28
> Selected Move:	2670	3	5	9	21500


> New Y[]: 
	
	 0  3  4  2  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,405

## ITERATION 77 #######################


> Neighbours evaluated; 29
> Selected Move:	2595	3	7	5	21000


> New Y[]: 
	
	 0  3  4  2  1  1  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 78 #######################


> Neighbours evaluated; 26
> Selected Move:	2550	3	6	7	22000


> New Y[]: 
	
	 0  3  4  2  1  1  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 79 #######################


> Neighbours evaluated; 27
> Selected Move:	2610	2	9	-1	16500


> New Y[]: 
	
	 0  3  4  2  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 80 #######################


> Neighbours evaluated; 28
> Selected Move:	2610	4	3	4	19500


> New Y[]: 
	
	 0  3  4  1  2  1  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 81 #######################


> Neighbours evaluated; 32
> Selected Move:	2700	3	3	8	18500


> New Y[]: 
	
	 0  3  4  0  2  1  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 82 #######################


> Neighbours evaluated; 30
> Selected Move:	2700	4	4	5	16800


> New Y[]: 
	
	 0  3  4  0  1  2  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 83 #######################


> Neighbours evaluated; 29
> Selected Move:	2715	1	-1	6	21300


> New Y[]: 
	
	 0  3  4  0  1  2  1  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 84 #######################


> Neighbours evaluated; 28
> Selected Move:	2788	3	7	9	21300


> New Y[]: 
	
	 0  3  4  0  1  2  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 85 #######################


> Neighbours evaluated; 27
> Selected Move:	2600	2	9	-1	15800


> New Y[]: 
	
	 0  3  4  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 86 #######################


> Neighbours evaluated; 27
> Selected Move:	2680	3	5	9	15800


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 87 #######################


> Neighbours evaluated; 28
> Selected Move:	2680	4	9	4	18000


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 88 #######################


> Neighbours evaluated; 31
> Selected Move:	2680	4	4	6	16800


> New Y[]: 
	
	 0  3  4  0  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 89 #######################


> Neighbours evaluated; 29
> Selected Move:	2680	4	6	8	15700


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  2  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 90 #######################


> Neighbours evaluated; 25
> Selected Move:	2630	3	6	7	16700


> New Y[]: 
	
	 0  3  4  0  1  0  0  1  2  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 91 #######################


> Neighbours evaluated; 27
> Selected Move:	2630	4	8	4	19000


> New Y[]: 
	
	 0  3  4  0  2  0  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 92 #######################


> Neighbours evaluated; 29
> Selected Move:	2630	4	4	7	16600


> New Y[]: 
	
	 0  3  4  0  1  0  0  2  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 93 #######################


> Neighbours evaluated; 26
> Selected Move:	2700	3	9	5	16100


> New Y[]: 
	
	 0  3  4  0  1  1  0  2  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 94 #######################


> Neighbours evaluated; 25
> Selected Move:	2610	3	1	3	18400


> New Y[]: 
	
	 0  0  4  3  1  1  0  2  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,405

## ITERATION 95 #######################


> Neighbours evaluated; 27
> Selected Move:	2850	3	7	0	16800


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,4

## ITERATION 96 #######################


> Neighbours evaluated; 33
> Selected Move:	2910	1	-1	6	21300


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 97 #######################


> Neighbours evaluated; 32
> Selected Move:	2925	3	3	7	20900


> New Y[]: 
	
	 2  0  4  0  1  1  1  3  1  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,39

## ITERATION 98 #######################


> Neighbours evaluated; 32
> Selected Move:	3046	4	7	8	20600


> New Y[]: 
	
	 2  0  4  0  1  1  1  1  3  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,385

## ITERATION 99 #######################


> Neighbours evaluated; 32
> Selected Move:	3129	3	7	9	20600


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  3  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 100 #######################


> Neighbours evaluated; 32
> Selected Move:	2942	3	5	7	21100


> New Y[]: 
	
	 2  0  4  0  1  0  1  1  3  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,385

## ITERATION 101 #######################


> Neighbours evaluated; 31
> Selected Move:	2844	3	6	5	21600


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  3  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,39

## ITERATION 102 #######################


> Neighbours evaluated; 30
> Selected Move:	2780	2	7	-1	16100


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 103 #######################


> Neighbours evaluated; 32
> Selected Move:	2850	3	9	3	17100


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,4

## ITERATION 104 #######################


> Neighbours evaluated; 32
> Selected Move:	2850	4	8	4	19300


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,405

## ITERATION 105 #######################


> Neighbours evaluated; 33
> Selected Move:	2850	4	4	5	17800


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 106 #######################


> Neighbours evaluated; 31
> Selected Move:	2780	3	3	9	16800


> New Y[]: 
	
	 2  0  4  0  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 107 #######################


> Neighbours evaluated; 32
> Selected Move:	2821	1	-1	6	21300


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 108 #######################


> Neighbours evaluated; 31
> Selected Move:	2856	4	5	9	21200


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  1  3 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 109 #######################


> Neighbours evaluated; 29
> Selected Move:	2780	2	6	-1	16700


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 110 #######################


> Neighbours evaluated; 30
> Selected Move:	2780	4	9	4	18300


> New Y[]: 
	
	 2  0  4  0  3  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 111 #######################


> Neighbours evaluated; 31
> Selected Move:	2780	3	4	1	16000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 112 #######################


> Neighbours evaluated; 32
> Selected Move:	3155	1	-1	6	20500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 113 #######################


> Neighbours evaluated; 34
> Selected Move:	3078	3	9	7	20500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 114 #######################


> Neighbours evaluated; 34
> Selected Move:	2960	3	5	9	21000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 115 #######################


> Neighbours evaluated; 33
> Selected Move:	2918	3	8	5	20500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 116 #######################


> Neighbours evaluated; 32
> Selected Move:	2845	3	6	8	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 117 #######################


> Neighbours evaluated; 29
> Selected Move:	2700	2	9	-1	16000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 118 #######################


> Neighbours evaluated; 30
> Selected Move:	2850	3	7	3	17000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 119 #######################


> Neighbours evaluated; 30
> Selected Move:	2850	3	2	4	19500


> New Y[]: 
	
	 2  3  0  1  4  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 120 #######################


> Neighbours evaluated; 29
> Selected Move:	2850	4	4	3	16700


> New Y[]: 
	
	 2  3  0  4  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 121 #######################


> Neighbours evaluated; 30
> Selected Move:	2908	1	-1	6	21200


> New Y[]: 
	
	 2  3  0  4  1  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 122 #######################


> Neighbours evaluated; 28
> Selected Move:	3140	3	3	9	20500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  1  4 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 123 #######################


> Neighbours evaluated; 28
> Selected Move:	3093	4	9	8	20600


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  4  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 124 #######################


> Neighbours evaluated; 28
> Selected Move:	3010	3	9	7	20600


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  4  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 125 #######################


> Neighbours evaluated; 28
> Selected Move:	3007	4	8	7	20600


> New Y[]: 
	
	 2  3  0  0  1  1  1  4  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 126 #######################


> Neighbours evaluated; 27
> Selected Move:	2854	3	5	9	21100


> New Y[]: 
	
	 2  3  0  0  1  0  1  4  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 127 #######################


> Neighbours evaluated; 28
> Selected Move:	2895	4	7	9	21000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  4 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 128 #######################


> Neighbours evaluated; 28
> Selected Move:	2885	3	8	5	20500


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  4 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 129 #######################


> Neighbours evaluated; 27
> Selected Move:	2835	4	9	7	20600


> New Y[]: 
	
	 2  3  0  0  1  1  1  4  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 130 #######################


> Neighbours evaluated; 26
> Selected Move:	2692	3	6	8	21600


> New Y[]: 
	
	 2  3  0  0  1  1  0  4  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 131 #######################


> Neighbours evaluated; 27
> Selected Move:	2732	4	7	9	21500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  4 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,49

## ITERATION 132 #######################


> Neighbours evaluated; 26
> Selected Move:	2780	2	7	-1	16000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  4 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 133 #######################


> Neighbours evaluated; 28
> Selected Move:	2780	4	9	4	18500


> New Y[]: 
	
	 2  3  0  0  4  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 134 #######################


> Neighbours evaluated; 27
> Selected Move:	2780	4	4	5	16600


> New Y[]: 
	
	 2  3  0  0  1  4  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,505

## ITERATION 135 #######################


> Neighbours evaluated; 29
> Selected Move:	2850	3	9	3	17600


> New Y[]: 
	
	 2  3  0  1  1  4  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,51

## ITERATION 136 #######################


> Neighbours evaluated; 28
> Selected Move:	2850	4	5	8	17100


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  4  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,515

## ITERATION 137 #######################


> Neighbours evaluated; 28
> Selected Move:	2780	3	3	9	16100


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  4  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,51

## ITERATION 138 #######################


> Neighbours evaluated; 26
> Selected Move:	2780	3	5	3	17600


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  4  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,505

## ITERATION 139 #######################


> Neighbours evaluated; 29
> Selected Move:	2780	4	8	3	17200


> New Y[]: 
	
	 2  3  0  4  1  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 140 #######################


> Neighbours evaluated; 28
> Selected Move:	2780	4	3	4	20000


> New Y[]: 
	
	 2  3  0  1  4  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 141 #######################


> Neighbours evaluated; 25
> Selected Move:	2780	4	4	9	17500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  4 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,49

## ITERATION 142 #######################


> Neighbours evaluated; 26
> Selected Move:	2750	3	9	6	17800


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 143 #######################


> Neighbours evaluated; 29
> Selected Move:	2750	4	6	3	16200


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 144 #######################


> Neighbours evaluated; 27
> Selected Move:	2750	4	3	4	19000


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 145 #######################


> Neighbours evaluated; 25
> Selected Move:	2750	4	4	8	16600


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  4  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 146 #######################


> Neighbours evaluated; 26
> Selected Move:	2700	3	6	7	17600


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  4  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 147 #######################


> Neighbours evaluated; 28
> Selected Move:	2700	4	8	3	17200


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 148 #######################


> Neighbours evaluated; 27
> Selected Move:	2700	4	3	4	20000


> New Y[]: 
	
	 2  3  0  1  4  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 149 #######################


> Neighbours evaluated; 24
> Selected Move:	2700	4	4	7	17600


> New Y[]: 
	
	 2  3  0  1  1  0  0  4  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 150 #######################


> Neighbours evaluated; 25
> Selected Move:	2700	3	3	5	16100


> New Y[]: 
	
	 2  3  0  0  1  1  0  4  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 151 #######################


> Neighbours evaluated; 26
> Selected Move:	2700	4	7	4	18500


> New Y[]: 
	
	 2  3  0  0  4  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 152 #######################


> Neighbours evaluated; 26
> Selected Move:	2700	4	4	5	16600


> New Y[]: 
	
	 2  3  0  0  1  4  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 153 #######################


> Neighbours evaluated; 26
> Selected Move:	2802	1	-1	6	21100


> New Y[]: 
	
	 2  3  0  0  1  4  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 154 #######################


> Neighbours evaluated; 26
> Selected Move:	2887	3	7	9	21100


> New Y[]: 
	
	 2  3  0  0  1  4  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 155 #######################


> Neighbours evaluated; 25
> Selected Move:	2788	3	5	3	21700


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 156 #######################


> Neighbours evaluated; 25
> Selected Move:	2716	3	9	7	21700


> New Y[]: 
	
	 2  3  0  4  1  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 157 #######################


> Neighbours evaluated; 25
> Selected Move:	2692	3	8	5	21200


> New Y[]: 
	
	 2  3  0  4  1  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 158 #######################


> Neighbours evaluated; 29
> Selected Move:	2610	2	6	-1	16700


> New Y[]: 
	
	 2  3  0  4  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 159 #######################


> Neighbours evaluated; 28
> Selected Move:	2700	3	3	8	16100


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  4  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 160 #######################


> Neighbours evaluated; 23
> Selected Move:	2772	1	-1	9	21600


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  4  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 161 #######################


> Neighbours evaluated; 24
> Selected Move:	2882	3	5	6	21100


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  4  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 162 #######################


> Neighbours evaluated; 25
> Selected Move:	2680	2	7	-1	15600


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  4  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 163 #######################


> Neighbours evaluated; 26
> Selected Move:	2680	4	8	4	18000


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 164 #######################


> Neighbours evaluated; 27
> Selected Move:	2680	4	4	6	16800


> New Y[]: 
	
	 2  3  0  0  1  0  4  0  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 165 #######################


> Neighbours evaluated; 26
> Selected Move:	2680	4	6	9	15500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  4 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 166 #######################


> Neighbours evaluated; 23
> Selected Move:	2630	3	6	7	16500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  4 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 167 #######################


> Neighbours evaluated; 24
> Selected Move:	2630	4	9	4	19000


> New Y[]: 
	
	 2  3  0  0  4  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 168 #######################


> Neighbours evaluated; 25
> Selected Move:	2630	4	4	7	16600


> New Y[]: 
	
	 2  3  0  0  1  0  0  4  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 169 #######################


> Neighbours evaluated; 22
> Selected Move:	2630	4	7	8	16600


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  4  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 170 #######################


> Neighbours evaluated; 21
> Selected Move:	2600	3	9	6	15600


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  4  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 171 #######################


> Neighbours evaluated; 24
> Selected Move:	2600	4	8	4	18000


> New Y[]: 
	
	 2  3  0  0  4  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 172 #######################


> Neighbours evaluated; 26
> Selected Move:	2600	4	4	6	16800


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 173 #######################


> Neighbours evaluated; 24
> Selected Move:	2600	4	6	7	15600


> New Y[]: 
	
	 2  3  0  0  1  0  1  4  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 174 #######################


> Neighbours evaluated; 21
> Selected Move:	2600	3	7	5	15600


> New Y[]: 
	
	 2  3  0  0  1  4  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,405

## ITERATION 175 #######################


> Neighbours evaluated; 23
> Selected Move:	2600	4	5	4	17500


> New Y[]: 
	
	 2  3  0  0  4  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,4

## ITERATION 176 #######################


> Neighbours evaluated; 25
> Selected Move:	2600	4	4	6	16300


> New Y[]: 
	
	 2  3  0  0  1  1  4  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 177 #######################


> Neighbours evaluated; 23
> Selected Move:	2649	1	-1	9	21800


> New Y[]: 
	
	 2  3  0  0  1  1  4  0  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,39

## ITERATION 178 #######################


> Neighbours evaluated; 25
> Selected Move:	2752	3	6	3	22200


> New Y[]: 
	
	 2  3  0  4  1  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,385

## ITERATION 179 #######################


> Neighbours evaluated; 25
> Selected Move:	2683	3	9	7	22200


> New Y[]: 
	
	 2  3  0  4  1  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 180 #######################


> Neighbours evaluated; 24
> Selected Move:	2610	4	0	5	19000


> New Y[]: 
	
	 0  3  0  4  1  2  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,375

## ITERATION 181 #######################


> Neighbours evaluated; 24
> Selected Move:	2610	4	3	5	18600


> New Y[]: 
	
	 0  3  0  2  1  4  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,37

## ITERATION 182 #######################


> Neighbours evaluated; 24
> Selected Move:	2610	4	3	7	19200


> New Y[]: 
	
	 0  3  0  1  1  4  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,365

## ITERATION 183 #######################


> Neighbours evaluated; 24
> Selected Move:	2610	4	5	3	18300


> New Y[]: 
	
	 0  3  0  4  1  1  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,36

## ITERATION 184 #######################


> Neighbours evaluated; 24
> Selected Move:	2610	4	3	7	18100


> New Y[]: 
	
	 0  3  0  2  1  1  0  4  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,355

## ITERATION 185 #######################


> Neighbours evaluated; 23
> Selected Move:	2610	4	3	5	19400


> New Y[]: 
	
	 0  3  0  1  1  2  0  4  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,35

## ITERATION 186 #######################


> Neighbours evaluated; 21
> Selected Move:	2610	4	5	8	18800


> New Y[]: 
	
	 0  3  0  1  1  1  0  4  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,345

## ITERATION 187 #######################


> Neighbours evaluated; 26
> Selected Move:	2610	4	7	3	18400


> New Y[]: 
	
	 0  3  0  4  1  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,34

## ITERATION 188 #######################


> Neighbours evaluated; 23
> Selected Move:	2610	4	3	5	19300


> New Y[]: 
	
	 0  3  0  1  1  4  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,335

## ITERATION 189 #######################


> Neighbours evaluated; 22
> Selected Move:	2610	4	5	8	19400


> New Y[]: 
	
	 0  3  0  1  1  2  0  1  4  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,33

## ITERATION 190 #######################


> Neighbours evaluated; 22
> Selected Move:	2610	4	5	3	18100


> New Y[]: 
	
	 0  3  0  2  1  1  0  1  4  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,325

## ITERATION 191 #######################


> Neighbours evaluated; 21
> Selected Move:	2610	4	3	7	18700


> New Y[]: 
	
	 0  3  0  1  1  1  0  2  4  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,32

## ITERATION 192 #######################


> Neighbours evaluated; 22
> Selected Move:	2610	3	8	2	17100


> New Y[]: 
	
	 0  3  4  1  1  1  0  2  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,315

## ITERATION 193 #######################


> Neighbours evaluated; 28
> Selected Move:	2711	1	-1	8	22600


> New Y[]: 
	
	 0  3  4  1  1  1  0  2  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,31

## ITERATION 194 #######################


> Neighbours evaluated; 23
> Selected Move:	2779	3	5	6	22100


> New Y[]: 
	
	 0  3  4  1  1  0  1  2  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,305

## ITERATION 195 #######################


> Neighbours evaluated; 28
> Selected Move:	2809	3	7	9	22300


> New Y[]: 
	
	 0  3  4  1  1  0  1  0  1  2 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,3

## ITERATION 196 #######################


> Neighbours evaluated; 27
> Selected Move:	2850	4	9	8	22200


> New Y[]: 
	
	 0  3  4  1  1  0  1  0  2  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,295

## ITERATION 197 #######################


> Neighbours evaluated; 26
> Selected Move:	2929	3	9	5	21700


> New Y[]: 
	
	 0  3  4  1  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,3

## ITERATION 198 #######################


> Neighbours evaluated; 26
> Selected Move:	2800	3	6	9	22700


> New Y[]: 
	
	 0  3  4  1  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,305

## ITERATION 199 #######################


> Neighbours evaluated; 25
> Selected Move:	2756	4	8	9	22800


> New Y[]: 
	
	 0  3  4  1  1  1  0  0  1  2 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,31

## ITERATION 200 #######################


> Neighbours evaluated; 26
> Selected Move:	2902	3	3	7	21800


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  1  2 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,315

## ITERATION 201 #######################


> Neighbours evaluated; 25
> Selected Move:	2736	4	9	5	22300


> New Y[]: 
	
	 0  3  4  0  1  2  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,32

## ITERATION 202 #######################


> Neighbours evaluated; 26
> Selected Move:	2704	3	8	6	21300


> New Y[]: 
	
	 0  3  4  0  1  2  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,325

## ITERATION 203 #######################


> Neighbours evaluated; 26
> Selected Move:	2540	2	6	-1	16800


> New Y[]: 
	
	 0  3  4  0  1  2  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,33
________________________________________________________________

Best solution found: 4100
Run Termination time: 31.01.2010 10:38:06
Run duration: 00:01:02.1406250
________________________________________________________________
